Optimal Adaptive Routing and Traffic Assignment in Stochastic Time-Dependent Networks
نویسندگان
چکیده
A stochastic time-dependent (STD) network is defined by treating all link travel times at all time periods as random variables, with possible time-wise and link-wise stochastic dependency. A routing policy is a decision rule which specifies what node to take next out of the current node based on the current time and online information. A formal framework is established for optimal routing policy problems in STD networks, including generic optimality conditions, and a comprehensive taxonomy with insights into variants of the problem. A variant pertinent to road traffic networks is studied in detail, where a discrete joint distribution of link travel times is used to accommodate the most general stochastic dependency among link travel times, and the access to perfect online information about link travel times is assumed. Both exact and approximation solution algorithms are designed and tested. The criteria of optimality are then extended to reliability measures, such as travel time variance and expected early/late schedule delays. The first routing-policy-based stochastic dynamic traffic assignment (DTA) model is established. A general framework is provided and the equilibrium problem is formulated as a fixed point problem with three components: the optimal routing policy generation module, the routing policy choice model and the policy-based dynamic network loader. An MSA (method of successive averages) heuristic is designed. Computational tests are carried out in a hypothetical network, where random incidents are the source of stochasticity. The heuristic converges satisfactorily in the test network under the proposed test settings. The adaptiveness in the routing policy based model leads to travel time savings at equilibrium. As a byproduct, travel time reliability is also enhanced. The value of online information is an increasing function of the incident probability. Travel time savings are high when market penetrations are low. However, the function of travel time saving against market penetration is not monotonic. This suggests that in a travelers’ information system or route guidance system, the information penetration needs to be chosen carefully to maximize benefits. Thesis Supervisor: Moshe E. Ben-Akiva Title: Edmund K. Turner Professor of Civil and Environmental Engineering
منابع مشابه
A Novel Protection Guaranteed, Quality of Transmission Aware Routing and Wavelength Assignment Algorithm for All-optical Networks
Transparent All Optical Networks carry huge traffic and any link failure can cause the loss of gigabits of data; hence protection and its guarantee becomes necessary at the time of failure. Many protection schemes were presented in the literature, but none of them speaks about protection guarantee. Also, in all optical networks, due to absence of regeneration capabilities, the physical layer i...
متن کاملDifferent Network Performance Measures in a Multi-Objective Traffic Assignment Problem
Traffic assignment algorithms are used to determine possible use of paths between origin-destination pairs and predict traffic flow in network links. One of the main deficiencies of ordinary traffic assignment methods is that in most of them one measure (mostly travel time) is usually included in objective function and other effective performance measures in traffic assignment are not considere...
متن کاملTHE PERIODIC GREEN VEHICLE ROUTING PROBLEM WITH CONSIDERING OF TIME-DEPENDENT URBAN TRAFFIC AND TIME WINDOWS
The travel times among demand points are strongly influenced by traffic in a supply chain. Due to this fact, the service times for customers are variable. For this reason, service time is often changes over a time interval in a real environment. In this paper, a time-dependent periodic green vehicle routing problem (VRP) considering the time windows for serving the customers and multiple trip i...
متن کاملReal-Time Traveler Information for Optimal Adaptive Routing in Stochastic Time-Dependent Networks
Real-time information can enable travelers to adapt to changing traffic conditions and make better routing decisions in uncertain networks. In this paper, a generic description of realtime online information is provided based on three schemes using partial online information and one scheme with no online information. A theoretical analysis shows that more error-free information is always better...
متن کاملOptimal Routing Policy Problems in Stochastic Time- Dependent Networks
We study optimal routing policy problems in stochastic time-dependent networks, where link travel times are modeled as random variables with time-dependent distributions. These are fundamental network optimization problems for a wide variety of applications, such as transportation and telecommunication systems. The routing problems studied can be viewed as counterparts of shortest path problems...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004